#include"RBtree.h"
#define N 10000
using namespace std;
int main()
{
	hu::RBtree<int, int> rb;
	vector<int> v;
	v.reserve(N);
	srand(time(0));

	for (size_t i = 0; i < N; i++)
	{
		v.push_back(i);
	}
	for (auto i :v)
	{
		if (i == 7)
			int j=0;
		rb.insert({ i,1 });
		cout << endl;
	}
	cout << "Hight:" << rb.Hight() << endl;
	cout << "blance:" << rb.isblance() << endl;

	return 0;
}